All variables were translated into binary variables, and implicit enumeration method was developed to solve the model. 把模型的变量转化为二进制变量,并用隐枚举法求出最优解。
We also present an algorithm based on implicit enumeration and simplex method on network. 在求解算法上,提出隐枚举法与网络单纯形法相结合的求解方法。
Secondly, the implicit enumeration method for solving the models is proposed. 采用二部图及其复盖建立数学模型,再用隐枚举法求解该模型。
3, Develop a new MPS implicit enumeration algorithm to aircraft landing scheduling problem independently, which achieve the computational effort increase linearly with problem size. 独立研究提出了飞机着陆调度问题的MPS隐枚举算法和相应的软件实现。实现了NPC问题计算量随规模的线性增长。
Optimal design of quantity and type of equipment with implicit enumeration 隐枚举法在矿山设备选型优化设计中的应用
4, Compare the algorithm efficiency of LP, MPS implicit enumeration optimize, MPS implicit enumeration with time-window and heuristic, shows that MPS implicit enumeration with time-window have near the same efficiency compared with heuristic one, but the former can satisfy more complicated subjects. 首次在国内对比研究线性规划算法、MPS隐枚举优化算法、MPS隐枚举时间窗算法和启发式算法的性能,MPS隐枚举时间窗算法和启发式算法具有相近的性能,但前者满足复杂约束能力较强。
The combination explosion problem is common in solving 0-1 integer programming with enumeration and implicit enumeration ways. 用穷举法和隐枚举法解0-1型整数规划问题时,常常遇到组合爆炸问题。
An Implicit Enumeration Method for the Bilevel Decision Problem Based on the Priority 一类基于优先级的隐枚举两层决策方法
In this paper, we discuss the branch and bound rules of implicit enumeration method solution and these rules can improve efficiency of the solution ( BIP). 讨论了隐数法解0-1规划(BIP)时的分枝与定界准则.运用这些准则可提高求解(BIP)的效率。
In order to solve this kind of programming, we mainly use implicit enumeration at present, this kind of solution has not been using some of its characteristic of structure. 求解这类规划,目前主要采用隐枚举法,这种解法没有充分利用它的一些结构特点。
The method is better than both implicit enumeration and branch and bound method, so it provid the better method to solve 0-1 integer programming. 此方法优于隐枚举法和分枝定界算法,因此为0-1规划的求解提供了更好的方法。
A new implicit enumeration method for polynomial zero-one programming is proposed in this paper. 提出了一个求解多项式0-1规划问题的隐枚举算法。
The article proposes a mixed algorithm for solving integral linear programming. In the algorithm the Branch-and-Bound Method is combined with the improving cutting-plane method and the implicit enumeration method. 本文是将分支定界法与改进的割平面法、隐枚举法相结合,提出一种解决整数线性规划的混合型方法。
This paper presents a new approach to solve 0-1 integer programming by using the Step by Step Optimization, which gains an advantage over the previously used Implicit Enumeration, particularly the number of variable is reduced. The result is obviously improved. 介绍了求解0&1整数规划的一种新方法,这种方法优于以往的隐枚举法,特别是在变量数较少时,效果尤为明显。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized. 本文提出用0-1整数规划的隐枚举法,求解网络的多中心问题,算法简单,容易实现。
Solving the Concentrator Location Problem in the local access network with implicit enumeration 使用隐数法解决局部访问网络中的集中器位置问题
Several methods are used to increase the efficiency of the Benders decomposition method. The continuity of generator maintenance is used to modify the forward detection part and the backup trace part of the implicit enumeration method to solve the master problem. 针对Benders分解法求解效率不高的问题,求解主问题时利用了机组检修连续性的特点,对Balas隐枚举法中的前向搜索部分和回溯部分进行了改进;
An implicit enumeration method was used to solve the problem. 根据模型特点,采用隐枚举法求解该问题。
Based on the solving process of implicit enumeration method, it writes the matching C language secure code, being tied with practical electric network to carry on experiment verification, based on the power flow calculation, it is able to get the valid result. 基于隐枚举法的求解过程,本文编写了相应的C语言程序代码,结合实际的电网进行实验验证,在潮流计算的基础上可以得到有效的结果。
Through modifying the implicit enumeration method which solve the 0-1 integer programming question, and is able to be applied to how to choose reducing power loss combination program. 通过对求解0-1整数规划问题的隐枚举法进行改进,可以应用到选择最优降损组合方案中。